Application of Gradient Steepest Descent Method to the Problem of Crystal Lattice Parametric Identification
نویسندگان
چکیده
The objective of this paperwork is the development of a crystal lattice parameter identification algorithm, which allows obtaining a more accurate solution compared to the Bravais unit cell estimation algorithm. To achieve the objective, we suggest solving the parameter identification problem using the steepest descent gradient method. The study of the parameter identification accuracy was conducted on a large number of modeled crystal lattices using the edges and angles similarity measures for Bravais unit cells.
منابع مشابه
A Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملA new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations
In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...
متن کاملHybrid steepest-descent method with sequential and functional errors in Banach space
Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...
متن کاملFaster gradient descent and the efficient recovery of images
Much recent attention has been devoted to gradient descent algorithms where the steepest descent step size is replaced by a similar one from a previous iteration or gets updated only once every second step, thus forming a faster gradient descent method. For unconstrained convex quadratic optimization these methods can converge much faster than steepest descent. But the context of interest here ...
متن کاملA Robust Online Parametric Identification Method for Non-Deteriorating and Deteriorating Distributed Element Models with Viscous Damping
The online parametric identification of deteriorating and non-deteriorating distributed element models (DEMs) with viscous damping is studied using a generalization of Masing model to provide the proper framework for identification. The approach renders the hysteretic response of the DEM into a time-independent single-valued mapping from equivalent displacement values into equivalent force valu...
متن کامل